A pseudorandom bit generator based on hyperbolic cosine function
نویسندگان
چکیده
In the literature, little attention is paid to devising and analyzing novel one dimensional chaotic mappings. our previous efforts, we have tried fold, translation & scale on arctangent function sigmoid respectively, which brings good results. this paper, do same obtain a variant of Hyperbolic Cosine Function. Both Bifurcation Diagram Lyapunov Exponent Spectrum manifest that new mapping possesses wonderful properties. Then, pseudorandom bit generator designed based it. Pseudorandom tests demonstrate much better than ones. It owns great application prospect.
منابع مشابه
A Pseudorandom Bit Generator based on Chaotic Coupled Map Lattices
In this paper, we discuss the properties of making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy, high dimensionality of the parent dynamical system, and very large period of the generated sequence. We propose the chaotic coupled map lattices as a pseudo random number generator. We show what chaotic features of the cou...
متن کاملA Pseudorandom Bit Generator Based on Block Upper Triangular Matrices
The popularity of the Web has created a great marketplace for businesses to sell and showcase their products increasing the need for secure Web services such as SSL, TLS or SET. We propose a pseudorandom bit generator that can be used to create a stream cipher directly applicable to these secure systems; it is based on the powers of a block upper triangular matrix achieving great statistical re...
متن کاملImproved Window Based On Cosine Hyperbolic Function
A new simple form window with the application of FIR filter design based on the exponential function is proposed in this article. An improved window having a closed simple formula which is symmetric ameliorates ripple ratio in comparison with cosine hyperbolic window. The proposed window has been derived in the same way as Kaiser window, but its advantages have no power series expansion in its ...
متن کاملPseudorandom Generator Based on Hard Lattice Problem
This paper studies how to construct a pseudorandom generator using hard lattice problems. We use a variation of the classical hard problem Inhomogeneous Small Integer Solution ISIS of lattice, say Inhomogeneous Subset Sum Solution ISSS. ISSS itself is a hash function. Proving the preimage sizes ISSS hash function images are almost the same, we construct a pseudorandom generator using the method...
متن کاملFast Pseudorandom Generator based on Packed Matrices
Pseudorandom generators are a basic foundation of many cryptographic services and information security protocols. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security. The resulting generator is successfully compared to world class standards. Key-Words: Pseudorandom Generator, Stream Ciphers, Binary Matrices, C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ITM web of conferences
سال: 2022
ISSN: ['2271-2097', '2431-7578']
DOI: https://doi.org/10.1051/itmconf/20224702001